Apparatus and method for synchronous multiplexing and multiple access for different latency targets utilizing thin control

ABSTRACT

Aspects of the disclosure provide for a thin control channel structure that can be utilized to enable multiplexing of two or more data transmission formats. For example, a thin control channel may carry information that enables ongoing transmissions utilizing a first, relatively long transmission time interval (TTI) to be punctured, and during the punctured portion of the long TTI, a transmission utilizing a second, relatively short TTI may be inserted. This puncturing is enabled by virtue of a thin channel structure wherein a control channel can carry scheduling information, grants, etc., informing receiving devices of the puncturing that is occurring or will occur. Furthermore, the thin control channel can be utilized to carry other control information, not being limited to puncturing information. Other aspects, embodiments, and features are also claimed and described.

PRIORITY CLAIM

This application claims priority to and the benefit of provisionalpatent application No. 62/000,443, titled “Apparatus and Method forSynchronous Multiplexing and Multiple Access for Different LatencyTargets Utilizing Thin Control” and filed in the United States Patentand Trademark Office on May 19, 2014, the entire content of which isincorporated herein by reference.

TECHNICAL FIELD

Aspects of the present disclosure relate generally to wirelesscommunication systems, and more particularly, to synchronousmultiplexing and multiple access for different latency targets utilizinga thin control channel.

BACKGROUND

Wireless communication networks are widely deployed to provide variouscommunication services such as telephony, video, data, messaging,broadcasts, and so on. Such networks, which are usually multiple accessnetworks, support communications for multiple users by sharing theavailable network resources.

Within such wireless networks a variety of data services may beprovided, including voice, video, and emails. More recently, wirelesscommunication networks are being utilized for an even broader range ofservices, including mission critical applications and remote controlapplications such as tele-surgery, where real-time feedback isnecessary. In such applications, very low latency is critical to enablea suitably high quality of service. That is, the time for information tobe transmitted from a communication device, and a response received backat the communication device, may need to be extremely rapid, on theorder of milliseconds.

As the demand for mobile broadband access continues to increase,research and development continue to advance wireless communicationtechnologies not only to meet the growing demand for mobile broadbandaccess, but to advance and enhance the user experience.

BRIEF SUMMARY OF SOME EXAMPLES

The following presents a simplified summary of one or more aspects ofthe present disclosure, in order to provide a basic understanding ofsuch aspects. This summary is not an extensive overview of allcontemplated features of the disclosure, and is intended neither toidentify key or critical elements of all aspects of the disclosure norto delineate the scope of any or all aspects of the disclosure. Its solepurpose is to present some concepts of one or more aspects of thedisclosure in a simplified form as a prelude to the more detaileddescription that is presented later.

One or more aspects of the present disclosure provide for a thin controlchannel structure. A thin control channel can be utilized to enablemultiplexing of two or more data transmission formats. For example, athin control channel may carry information that enables ongoingtransmissions utilizing a first, relatively long transmission timeinterval (TTI) to be punctured, and during the punctured portion of thelong TTI, a transmission utilizing a second, relatively short TTI may beinserted. Other differences between the first (punctured) transmissionand second (puncturing) transmission can also be enabled, includingdifferences in symbol duration or format, or different priorities oftraffic, for example. This puncturing is enabled by virtue of a thinchannel structure wherein a control channel can carry schedulinginformation, grants, etc. informing receiving devices of the puncturingthat is occurring or will occur. Furthermore, the thin control channelcan be utilized to carry other control information, not being limited topuncturing information.

In one aspect, the disclosure provides a method, apparatus, andcomputer-readable medium having code for implementing wirelesscommunication utilizing an algorithm for synchronous multiplexing andmultiple access for different latency targets utilizing thin control.Here, a scheduling entity may transmit first user data on a downlinkdata channel utilizing a first transmission time interval (TTI), and mayfurther transmit control information on a downlink control channelutilizing a second TTI shorter in duration than the first TTI, duringthe transmission of the first user data. The control information may beconfigured to modify processing of the downlink data channel.

Another aspect of the disclosure provides a method, apparatus, andcomputer-readable medium having code for implementing wirelesscommunication utilizing an algorithm for synchronous multiplexing andmultiple access for different latency targets utilizing thin control.Here, a scheduling entity may receive first user data on an uplink datachannel utilizing a first TTI. The scheduling entity may further receivea scheduling request on an uplink feedback channel, the schedulingrequest being configured to request a grant of time-frequency resourcesfor second user data. The scheduling entity may further transmit controlinformation on a downlink control channel, utilizing a second TTI thatis shorter in duration than the first TTI during reception of the firstuser data on the uplink data channel. The control information mayinclude a second user data grant for time-frequency resourcescorresponding to the second user data on the uplink data channelutilizing the second TTI. The scheduling entity may further receive thesecond user data on the uplink data channel utilizing the second TTI.

These and other aspects of the invention will become more fullyunderstood upon a review of the detailed description, which follows.Other aspects, features, and embodiments of the present invention willbecome apparent to those of ordinary skill in the art, upon reviewingthe following description of specific, exemplary embodiments of thepresent invention in conjunction with the accompanying figures. Whilefeatures of the present invention may be discussed relative to certainembodiments and figures below, all embodiments of the present inventioncan include one or more of the advantageous features discussed herein.In other words, while one or more embodiments may be discussed as havingcertain advantageous features, one or more of such features may also beused in accordance with the various embodiments of the inventiondiscussed herein. In similar fashion, while exemplary embodiments may bediscussed below as device, system, or method embodiments it should beunderstood that such exemplary embodiments can be implemented in variousdevices, systems, and methods.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a schematic timing diagram illustrating components ofend-to-end latency in a wireless communication system according to someembodiments.

FIG. 2 is a block diagram conceptually illustrating an example of ascheduling entity communicating with one or more subordinate entitiesaccording to some embodiments.

FIG. 3 is a block diagram illustrating an example of a hardwareimplementation for a scheduling entity employing a processing systemaccording to some embodiments.

FIG. 4 is a block diagram illustrating an example of a hardwareimplementation for a subordinate entity employing a processing systemaccording to some embodiments.

FIG. 5 is a schematic diagram illustrating an example of a synchronousmultiple access channel structure for a downlink transmission includinga thin control channel according to some embodiments.

FIG. 6 is a schematic diagram illustrating downlink/downlinkmultiplexing utilizing a thin control channel according to someembodiments.

FIG. 7 is a call flow diagram illustrating an example of multiplexingdownlink communications of different transmission time intervals (TTIs)utilizing a thin control channel according to some embodiments.

FIG. 8 is a flow chart illustrating an example of multiplexing downlinkcommunications of different TTIs utilizing a thin control channel fromthe point of view of a scheduling entity, according to some embodiments.

FIG. 9 is a schematic diagram illustrating an example of a synchronousmultiple access channel structure for an uplink transmission including athin control channel according to some embodiments.

FIG. 10 is a schematic diagram illustrating uplink/uplink multiplexingutilizing a thin control channel according to some embodiments.

FIG. 11 is a call flow diagram illustrating an example of multiplexinguplink communications of different TTIs utilizing a thin control channelaccording to some embodiments.

FIG. 12 is a flow chart illustrating an example of multiplexing uplinkcommunications of different TTIs utilizing a thin control channel fromthe point of view of a scheduling entity, according to some embodiments.

FIG. 13 is a flow chart illustrating an example of interferencemanagement utilizing a thin control channel according to someembodiments.

DETAILED DESCRIPTION

The detailed description set forth below in connection with the appendeddrawings is intended as a description of various configurations and isnot intended to represent the only configurations in which the conceptsdescribed herein may be practiced. The detailed description includesspecific details for the purpose of providing a thorough understandingof various concepts. However, it will be apparent to those skilled inthe art that these concepts may be practiced without these specificdetails. In some instances, well known structures and components areshown in block diagram form in order to avoid obscuring such concepts.

The various concepts presented throughout this disclosure may beimplemented across a broad variety of telecommunication systems, networkarchitectures, and communication standards. For example, the 3^(rd)Generation Partnership Project (3GPP) is a standards body that definesseveral wireless communication standards for networks including theevolved packet system (EPS), frequently referred to as long-termevolution (LTE) networks. LTE networks can provide end-to-end latencybetween a transmitting device and a receiving device on the order of 50ms, with over-the-air latency for a particular packet being in the rangeof 10 ms. Currently known LTE functionality provides for a round triptime (RTT) for certain feedback signaling (i.e., hybrid automatic repeatrequest (HARQ) signaling) of at least about 8 ms, using a transmissiontime interval (TTI) of 1 ms. Here, a TTI may correspond to a minimumduration for a unit of information that can independently be decoded.For time division duplex (TDD) LTE configurations, the uplink/downlinklatency has a relatively fixed configuration, which takes around 10 msto change. In general, LTE provides for a one-size-fits-all approachwith all services and packets relying on these same latency ranges.

Evolved versions of the LTE network, such as a fifth-generation (5G)network, may provide for many different types of services orapplications, including but not limited to web browsing, videostreaming, VoIP, mission critical applications, multi-hop networks,remote operations with real-time feedback (e.g., tele-surgery), etc.Here, these different sets of services may benefit from having multiplelatency targets that are drastically different from one another.However, the one-size-fits-all aspects of the LTE network describedabove can make the multiplexing of traffic with different latencytargets very difficult.

The spectrum compatibility of a system that supports such diverselatency targets can be challenging. For example, the time multiplexingof regular/low latency traffic could violate the requirements of lowlatency packets. Furthermore, reserved frequency domain resources forlow latency traffic would limit the peak rate and trunking efficiency.Thus, for next generation networks there is a need for new ways tosupport the ability to multiplex traffic and services having drasticallydifferent latency characteristics.

According to some aspects of the present disclosure, apparatus, methods,and computer instructions are disclosed, providing a channel structurethat enables synchronous multiplexing of different classes of servicesand traffic having different latency targets by utilizing a certain thincontrol channel. This thin control channel may provide for fastsignaling to enable the multiplexing of data with short and longtransmission time intervals.

Referring now to FIG. 1, a schematic timing diagram is shown (not toscale) to illustrate a breakdown of various components of a totalend-to-end latency in an example of a wireless communication system,which may correspond to some aspects of the present disclosure. In thisexample, a nominal end-to-end latency 102 is shown, representing thetime between a user's input, corresponding to the usage of anapplication on a wireless communication device, and the response beingapplied to the application.

Based on the user input, there may be some time associated withapplication processing 104, followed by a further time delay associatedwith the air interface 106. In the illustration, this air interfaceportion of the total latency is further broken down to illustrate theair interface time. Here, the time associated with upper layerprocessing, transmitter baseband processing, and physical layertransmission of a frame from the wireless communication device representa user portion of the air interface delay 106. After a propagation delayfrom the transmitting node to the receiving node, which may be in therange of 1-5 μs, the receiving node receives the physical layer frame,performs its own receiver baseband processing, and upper layerprocessing. This represents a receiving node portion of the airinterface delay 106.

After the air interface component of the latency, the receiving nodesends corresponding data through a suitable backhaul connection, with anassociated backhaul propagation delay 108, which may be in the range of100 μs for transmission in the range of 30 km. In many cases, this maybe an optimistic estimate, and backhaul propagation distance mayactually be hundreds of kilometers, resulting in correspondingly longerlatencies. The “cloud” propagation delay 110 represents any suitablecore network processing, with a period of latency that may takedifferent amounts of time depending on needed processing and transporttime. In some examples, the cloud portion of the end-to-end latency maybe hundred(s) of μs. The process is then reversed, propagating across asuitable backhaul network 112 to a base station or other node, over anair interface 114 back to a receiving device, followed by applicationprocessing 116. At this point, the response is applied at the receivingdevice, resulting in the total end-to-end latency 102.

For advanced network topologies, such as 5G networks, it may be desiredthat such end-to-end latency 102 be roughly on the order of 1 ms. Tomeet this goal, the air interface portions 106 and 114 of the latencyshould each be in the range of 100 μs. To illustrate this latency,consider an example corresponding to transmission and processing of aping packet. A ping packet may be a type of control packet that includes32 bytes of information. If this packet is transmitted (after encoding)over five 256-bit frames, to achieve air interface latency of 20 μs, alink having a data rate of 12 Mbps (256 bits/20 μs) is required.Similarly, for data packets (such as IP packets) having an exemplarylength of 1500 bytes (12 kb), if an air interface latency of 100 μs isdesired, a link having a data rate of 120 Mbps (12 kb/100 μs) isrequired.

To enable data rates of this magnitude, advanced control mechanisms forthe wireless communication network are needed. Furthermore, for manyhigher-rate applications, reduced total latency is desired. To providefor reduced latency in some applications, a reduced transmission timeinterval (TTI) may be desired.

As indicated above, one or more aspects of the present disclosureprovide for a channel structure that enables multiplexing of a varietyof different channels and waveforms, each of which may be optimized fordifferent efficiency, latency, and/or reliability requirements. Forexample, various aspects of the disclosure describe a channel structurethat is synchronous (e.g., time synchronous, with channel timing managedand controlled among the various communication nodes by way of ascheduling entity) and/or orthogonal (e.g., sharing the same resourcesin a way that communication nodes substantially do not interfere withone another).

Referring now to FIG. 2, a block diagram illustrates a scheduling entity202 and a plurality of subordinate entities 204 engaged in wirelesscommunication utilizing thin control channels 208/212 and thin feedbackchannel 214, described in further detail below. Of course, the channelsillustrated in FIG. 2 are not necessarily all of the channels that maybe utilized between a scheduling entity 202 and subordinate entities204, and those of ordinary skill in the art will recognize that otherchannels may be utilized in addition to those illustrated, such as othercontrol and feedback channels. As illustrated in FIG. 2, the schedulingentity 202 may broadcast downlink data 206 to one or more subordinateentities 204. In accordance with aspects of the present disclosure, theterm downlink may refer to a point-to-multipoint transmissionoriginating at the scheduling entity 202. Broadly, the scheduling entity202 is a node or device responsible for scheduling traffic in a wirelesscommunication network, including the downlink transmissions and, in someexamples, uplink data 210 from one or more subordinate entities to thescheduling entity 202. (Another way to describe the scheme may be to usethe term broadcast channel multiplexing.) In accordance with aspects ofthe present disclosure, the term uplink may refer to a point-to-pointtransmission originating at a subordinate entity 204. Broadly, thesubordinate entity 204 is a node or device that receives schedulingcontrol information, including but not limited to scheduling grants,synchronization or timing information, or other control information fromanother entity in the wireless communication network such as thescheduling entity 202.

In a further aspect of the disclosure, the scheduling entity 202 maybroadcast a thin control channel 208 and/or 212 to one or moresubordinate entities 204. As described herein below, the use of a thincontrol channel 208/212 can enable modification/puncturing of uplinkand/or downlink data being transmitted using a first, long transmissiontime interval (TTI), with other data (e.g., low latency (LoLat) packets)utilizing a second, short TTI. Here, a TTI may correspond to anencapsulated set or packet of information capable of being independentlydecoded, i.e., the shortest decodable transmission of information. Invarious examples, TTIs may correspond to frames, to data blocks, timeslots, or other suitable groupings of bits for transmission.

In the description that follows, for ease of discussion it is assumedthat the multiplexed data includes latency-tolerant data using a longTTI, and low-latency (LoLat) data using a short TTI. However, this ismerely one example of the multiplexing of different types or categoriesof data that may be enabled utilizing the thin control channelsdisclosed herein. That is, those of ordinary skill in the art willcomprehend that the thin control channels disclosed herein may beutilized for many rapid and relatively modifications to downlink data.

Furthermore, the subordinate entities 204 may transmit a thin feedbackchannel 214 to the scheduling entity 202. The thin feedback channel 214may in some examples include a request for the scheduling entity tomodify/puncture a first, long TTI with LoLat packets utilizing a second,short TTI. Here, in response to the request transmitted on the thinfeedback channel 214, the scheduling entity 202 may transmit in the thincontrol channel 212 information that may schedulemodification/puncturing of the long, first TTI with LoLat packetsutilizing the second, short TTI. In a further example, the thin feedbackchannel 214 may include information about interference experienced atthe subordinate entity 204, which the scheduling entity 202 may utilizedynamically to modify downlink transmissions in a way that may makefurther downlink transmissions more robust to the interference.

FIG. 3 is a conceptual diagram illustrating an example of a hardwareimplementation for an exemplary scheduling entity 202 employing aprocessing system 314. In accordance with various aspects of thedisclosure, an element, or any portion of an element, or any combinationof elements may be implemented with a processing system 314 thatincludes one or more processors 304.

In various aspects of the disclosure, the scheduling entity 202 may beany suitable radio transceiver apparatus, and in some examples, may beembodied by a base station (BS), a base transceiver station (BTS), aradio base station, a radio transceiver, a transceiver function, a basicservice set (BSS), an extended service set (ESS), an access point (AP),a Node B, an eNode B (eNB), mesh node, relay, or some other suitableterminology. A base station may provide wireless access points to a corenetwork for any number of user equipment (UE).

In other examples, the scheduling entity 202 may be embodied by awireless UE. Examples of a UE include a cellular phone, a smart phone, asession initiation protocol (SIP) phone, a laptop, a notebook, anetbook, a smartbook, a personal digital assistant (PDA), a satelliteradio, a global positioning system (GPS) device, a multimedia device, avideo device, a digital audio player (e.g., MP3 player), a camera, agame console, an entertainment device, a vehicle component, a wearablecomputing device (e.g., a smart watch, a health or fitness tracker,etc.), an appliance, a sensor, a vending machine, or any other similarfunctioning device. The UE may also be referred to by those skilled inthe art as a mobile station (MS), a subscriber station, a mobile unit, asubscriber unit, a wireless unit, a remote unit, a mobile device, awireless device, a wireless communications device, a remote device, amobile subscriber station, an access terminal (AT), a mobile terminal, awireless terminal, a remote terminal, a handset, a terminal, a useragent, a mobile client, a client, or some other suitable terminology.

Examples of processors 304 include microprocessors, microcontrollers,digital signal processors (DSPs), field programmable gate arrays(FPGAs), programmable logic devices (PLDs), state machines, gated logic,discrete hardware circuits, and other suitable hardware configured toperform the various functionality described throughout this disclosure.That is, the processor 304, as utilized in a scheduling entity 202, maybe used to implement any one or more of the processes described belowand illustrated in FIGS. 7, 8, 11, 12, and/or 13.

In this example, the processing system 314 may be implemented with a busarchitecture, represented generally by the bus 302. The bus 302 mayinclude any number of interconnecting buses and bridges depending on thespecific application of the processing system 314 and the overall designconstraints. The bus 302 links together various circuits including oneor more processors (represented generally by the processor 304), amemory 305, and computer-readable media (represented generally by thecomputer-readable medium 306). The bus 302 may also link various othercircuits such as timing sources, peripherals, voltage regulators, andpower management circuits, which are well known in the art, andtherefore, will not be described any further. A bus interface 108provides an interface between the bus 302 and a transceiver 310. Thetransceiver 310 provides a means for communicating with various otherapparatus over a transmission medium. Depending upon the nature of theapparatus, a user interface 312 (e.g., keypad, display, speaker,microphone, joystick) may also be provided.

In some aspects of the disclosure, the processor 304 may includeresource assignment and TTI control circuitry 341, configured togenerate, schedule, and modify a resource assignment or grant oftime-frequency resources. The resource assignment and TTI controlcircuitry 341 may further be configured to determine the TTI to utilizefor uplink and downlink transmissions, e.g., whether data transmissionsshould utilize a first, long TTI, or a second, short TTI. The resourceassignment and TTI control circuitry 341 may operate in coordinationwith resource assignment and TTI control software 351. The processor 304may further include data and control channel generation and transmissioncircuitry 342, configured to generate and transmit uplink and downlinkdata and control channels, as well as uplink feedback channels anddownlink control channels, including but not limited to a thin controlchannel, a thin feedback channel, and an assignment channel. The dataand control channel generation and transmission circuitry 342 mayoperate in coordination with data and control channel generation andtransmission software 352. The processor 304 may further include thinfeedback reception and processing circuitry 343, configured to receivescheduling requests on an uplink feedback channel, the schedulingrequests being configured to request a grant of time-frequency resourcesfor uplink user data transmissions. In some examples, the thin feedbackreception and processing circuitry 343 may further be configured toreceive and process interference metrics including but not limited to achannel quality indicator (CQI). The thin feedback reception andprocessing circuitry 343 may operate in coordination with thin feedbackreception and processing software 353. The processor 304 may furtherinclude data channel reception and processing circuitry 344, configuredto receive and process user data on uplink data channels from one ormore subordinate entities. The data channel reception and processingcircuitry 344 may operate in coordination with data channel andreception and processing software 354. The processor 304 may furtherinclude interference detection circuitry 345, configured for detectinginterference that interferes with uplink and/or downlink communicationwith one or more subordinate entities. The interference detectioncircuitry 345 may operate in coordination with interference detectionsoftware 355. The processor 304 may further include interferencemetric/channel quality indicator determination and transmissioncircuitry 346, configured to generate one or more of a channel qualityindicator (CQI), persistency information relating to the interference, afrequency of the interference, a power of the interference, or spatialinformation corresponding to the interference. The interferencemetric/CQI determination and transmission circuitry 346 may operate incoordination with interference metric/CQI determination and transmissionsoftware 356. The processor 304 may further include modulation andcoding configuration circuitry 347, configured for determining amodulation and coding scheme (MCS) to utilize for downlink transmissionsand/or a MCS for a subordinate entity to utilize for uplinktransmissions. The modulation and coding configuration circuitry 347 mayoperate in coordination with modulation and coding configurationsoftware 357.

The processor 304 is responsible for managing the bus 302 and generalprocessing, including the execution of software stored on thecomputer-readable medium 306. The software, when executed by theprocessor 304, causes the processing system 314 to perform the variousfunctions described below for any particular apparatus. Thecomputer-readable medium 306 may also be used for storing data that ismanipulated by the processor 304 when executing software.

One or more processors 304 in the processing system may executesoftware. Software shall be construed broadly to mean instructions,instruction sets, code, code segments, program code, programs,subprograms, software modules, applications, software applications,software packages, routines, subroutines, objects, executables, threadsof execution, procedures, functions, etc., whether referred to assoftware, firmware, middleware, microcode, hardware descriptionlanguage, or otherwise. The software may reside on a computer-readablemedium 306. The computer-readable medium 306 may be a non-transitorycomputer-readable medium. A non-transitory computer-readable mediumincludes, by way of example, a magnetic storage device (e.g., hard disk,floppy disk, magnetic strip), an optical disk (e.g., a compact disc (CD)or a digital versatile disc (DVD)), a smart card, a flash memory device(e.g., a card, a stick, or a key drive), a random access memory (RAM), aread only memory (ROM), a programmable ROM (PROM), an erasable PROM(EPROM), an electrically erasable PROM (EEPROM), a register, a removabledisk, and any other suitable medium for storing software and/orinstructions that may be accessed and read by a computer. Thecomputer-readable medium may also include, by way of example, a carrierwave, a transmission line, and any other suitable medium fortransmitting software and/or instructions that may be accessed and readby a computer. The computer-readable medium 306 may reside in theprocessing system 314, external to the processing system 314, ordistributed across multiple entities including the processing system314. The computer-readable medium 306 may be embodied in a computerprogram product. By way of example, a computer program product mayinclude a computer-readable medium in packaging materials. Those skilledin the art will recognize how best to implement the describedfunctionality presented throughout this disclosure depending on theparticular application and the overall design constraints imposed on theoverall system.

FIG. 4 is a conceptual diagram illustrating an example of a hardwareimplementation for an exemplary subordinate entity 204 employing aprocessing system 414. In accordance with various aspects of thedisclosure, an element, or any portion of an element, or any combinationof elements may be implemented with a processing system 414 thatincludes one or more processors 404.

The processing system 414 may be substantially the same as theprocessing system 314 illustrated in FIG. 3, including a bus interface408, a bus 402, memory 405, a processor 404, and a computer-readablemedium 406. Furthermore, the subordinate entity 204 may include a userinterface 412 and a transceiver 410 substantially similar to thosedescribed above in FIG. 3. The processor 404, as utilized in asubordinate entity 204, may be used to implement any one or more of theprocesses described below and illustrated in FIGS. 7, 8, 11, 12, and/or13.

In some aspects of the disclosure, the processor 404 may include dataand feedback channel generation and transmission circuitry 442,configured to generate and transmit uplink data on a data channel, andto generate and transmit uplink feedback on a feedback channel. The dataand feedback channel generation and transmission circuitry 442 mayoperate in coordination with data and feedback channel generation andtransmission software 452. The processor 404 may further include dataand control channel reception and processing circuitry 444, configuredfor receiving and processing downlink data on a data channel, and toreceive and process control information on one or more downlink controlchannels. In some examples, received downlink data and/or controlinformation may be temporarily stored in a data buffer within memory405. The processor 404 may further include interference metric/channelquality information (CQI) determination and transmission circuitry 446,configured for detecting interference that interferes with uplink and/ordownlink communication with one or more scheduling entities, andgenerating one or more of a CQI, persistency information relating to theinterference, a frequency of the interference, a power of theinterference, or spatial information corresponding to the interference,for transmission to the scheduling entity. The interference metric/CQIdetermination and transmission circuitry 446 may operate in coordinationwith the interference metric/CQI determination and transmission software456.

As described below, some aspects of the disclosure provide fordownlink-downlink multiplexing, wherein a scheduling entity may beenabled to multiplex low-latency downlink data alongside the ongoingtransmission of high-latency data. Further aspects of the disclosureprovide for uplink-uplink multiplexing, wherein, at the request of asubordinate entity, a scheduling entity may be enabled to schedule anopportunity for the subordinate entity to multiplex low-latency uplinkdata alongside the ongoing transmission of high-latency data.

Of course, these examples are merely provided to illustrate certainconcepts of the invention. Those of ordinary skill in the art willcomprehend that these are merely exemplary in nature, and other examplesmay fall within the scope of the disclosure and the appended claims,such as uplink-downlink multiplexing and downlink-uplink multiplexing.

DL/DL Multiplexing

FIG. 5 is a schematic illustration of an example of a synchronousmultiple access channel structure including a thin control channel as itmay be implemented according to some aspects of the present disclosure.In this illustration, the channel structure may be applicable to adownlink data transmission, i.e., a transmission from a schedulingentity to one or more subordinate entities. Of course, this channelstructure is not limited to such a scheme, but rather may be generalizedto be applicable to any link where the transmitting device is schedulingthe traffic.

In the illustration, the horizontal axis (t) represents time, while thevertical axis (f) represents frequency (not to scale). Channeltime-frequency resources for various users of the air interface occupygiven areas within the channel, as identified in the different blocks.For example, some of the time-frequency resources may be utilized by“regular” users 502, which have less stringent latency requirements fortheir communication. In the illustration, as one example, six regularusers 502 labeled User A, B, C, D, E, and F are each scheduledtime-frequency resources as indicated by their respectfully labeledblocks. Of course, in various examples any number of users may bescheduled the use of resources. Further, while in the illustration allof the time-frequency resources are shown being assigned to regularusers, in various examples some or even all of the time-frequencyresources may be unassigned, or assigned for another purpose other thanfor regular user data.

In the context of the present disclosure, a regular user 502 may be asubordinate entity 204 that receives a resource assignment from ascheduling entity 202, where the resource assignment indicates for thesubordinate entity 204 to utilize a long transmission time interval(TTI). Such regular users 502 may be more tolerant to latency in theircommunication, and may in some examples be more optimized for capacity.Accordingly, these users may utilize such longer TTIs for packets thatcan tolerate more latency than other users or other types ofcommunication that might require low latency (LoLat) communication. Along TTI may broadly be any TTI that is longer than a short TTI,described in further detail below. In some examples, a long TTI may be aTTI that has a duration of a plurality of data symbols, or time slots.Some non-limiting examples of a long TTI may have a duration of 100 μs,240 μs, or 1 ms. Of course, any suitable duration for a long TTI may beutilized within the scope of the disclosure.

Furthermore, as illustrated in FIG. 5, in addition to the downlinktraffic channels used by the regular users 502, a thin control channel506 may be utilized as illustrated. Here, the thin control channel 506may be the same as one or both of the thin control channels 208/212described above and illustrated in FIG. 2. Within the presentdisclosure, the thin control channel may lie in one or more frequencysub-band(s) outside of (e.g., above) the frequency sub-bands utilized bythe traffic transmissions, such as the allocated time-frequencyresources described above for regular users A-F 502. The width of thethin control channel 506 in the frequency direction may be reduced orminimized so as to reduce or minimize the amount of overhead utilized bythe control channel 506.

In a further aspect, all active users (e.g., subordinate entities 204including but not necessarily limited to the regular users 502) incommunication with the scheduling entity 202 that broadcasts the thincontrol channel 506 may monitor (and, in some examples, buffer) the thincontrol channel 506 shown herein. Here, the terminology “thin” inreference to the control channel 506 may refer to a short or thinduration in time over which units of information may be transmitted overthe channel. For example, as illustrated in FIG. 5, each time slot,symbol, or unit of the thin control channel 506 may correspond to theduration of a short TTI. That is, in some examples, the short TTI maycorrespond to the time duration of a single symbol. Some non-limitingexamples of a short TTI may have a duration of 10 μs, 20 μs, 100 μs, orany other suitable duration that is shorter than the long TTI. In someexamples, the long TTI may represent an integer multiple of short TTIs.In some examples, a common symbol duration may be utilized within boththe long TTI and the short TTI, or in other examples, different symboldurations may be utilized within the long TTI and the short TTI.

The thin control channel 506 may carry any suitable control informationfor the subordinate entities 204, such as the regular users 502,including but not limited to scheduling or grants of time-frequencyresources to utilize for uplink and/or downlink transmissions. Inparticular, as described in further detail below, the thin controlchannel 506 may enable a fast re-allocation of already-scheduledtime-frequency resources to subordinate entities that may wish tocommunicate in a low-latency manner. That is, the thin control channel506 may be utilized in some examples to modify in-flight data (e.g., tomodify an existing assignment of downlink resources to the regular users502).

That is, at any time, one or more subordinate entities 204 incommunication with the scheduling entity 202 may come to needlow-latency (LoLat) communication with the network, wherein morestringent latency requirements for communication are needed than therelatively long latency resulting from the communication by regularusers 502 utilizing the long TTI. Thus, in an aspect of the presentdisclosure, the thin control channel 506 may enable dynamic multiplexingof the traffic for one or more subordinate entities that desire lowlatency communication (hereinafter referred to as LoLat users 504), whocan utilize a short TTI for data traffic, and the traffic for theregular users 502, who utilize the long TTI for data traffic.

Referring now to FIG. 6, an example is illustrated to show an exemplaryscheme for a re-allocation of time-frequency resources from one or moreregular users 502 to one or more LoLat users 504. That is, a pluralityof regular users 502 may be receiving downlink communications utilizingan existing assignment of time-frequency resources. Here, any suitablecontrol channel, including but not necessarily limited to the thincontrol channel 506, may be utilized to grant resources to the variousentities in the network, such that those subordinate entities 204 mayreceive downlink data according to their respective assignments. Allactive subordinate entities with in-flight data corresponding to theirexisting assignments may monitor the thin control channel 506, asdescribed above, with the possible exception of any subordinate entitiesthat have insufficient processing capabilities to do so. By monitoringthe thin control channel 506, existing assignments of resources may bemodified in accordance with control information on the thin controlchannel 506, such that ongoing traffic by regular users 502 may bereplaced with information for the LoLat user 504.

That is, in an aspect of the disclosure, within a short TTI thatoverlaps a portion of one or more long TTIs, the scheduling entity 202may transmit data designated for one or more LoLat user(s) 504. In someexamples, to accommodate the LoLat transmission, the scheduling entity202 may puncture the long TTI transmission (e.g., cease the downlinkdata transmission to the regular user 502) for the duration of one ormore short TTIs. Here, when the regular data is punctured, it may be thecase that some of the regular data is simply lost. In this example,forward error correction coding may be utilized to recover the user datain view of the lost symbols due to the puncturing. In another example,the scheduling entity 202 may implement rate matching to account for thepuncturing of the regular user data. That is, the scheduling entity 202may modify a portion of the regular data utilizing a rate matchingalgorithm to account for the lost resources. Those of ordinary skill inthe art will understand a rate matching procedure, so the implementationdetails thereof are not provided herein. However, in essence, a ratematching algorithm configures an encoding algorithm for the data (e.g.,the regular user data) to fit into allocated physical resources. Thus,when the puncturing described above removes a portion of theseresources, a rate matching algorithm may actively adjust the encoding(e.g., by adjusting a coding rate) to account for the reduced amount ofresources.

In another aspect of the disclosure, rather than puncturing thetime-frequency resources for the regular user data, the data for theregular user 502 and the data for the LoLat user 504 may overlap. Thatis, both downlink transmissions may occupy the same time-frequencyresources. Here, the receiving devices may be configured to account forthe interference that may occur, or in other examples, such interferencemay result in what may be considered acceptable data losses. In afurther example, modification of the regular user data transmission 502may be made to account for the overlapped transmissions, e.g., byadjusting the rate matching algorithm as described above.

Accordingly, already allocated time-frequency resources may dynamicallybe re-allocated in real time from one user to another, as enabled byvirtue of the thin control channel 506.

As illustrated in FIG. 6, at the same time as the downlink data for theLoLat user 504 is transmitted, information corresponding to the LoLatdata may be carried on the thin control channel 506. For example,control information 508, transmitted on the thin control channel 506during the short TTI(s) when the downlink data for LoLat users 504 istransmitted, may be a grant modification that informs the regular users502 that resources during that short TTI are being taken away andreassigned to another user. In this way, the regular user 502 can knowthat, while it was originally expecting data on that resource, instead,the information on that resource is essentially random data or noise forthat regular user 502.

The control information 508 may be structured in any suitable manner. Asone example, the control information 508 may include an indication thata particular time-frequency resource, or a particular range oftime-frequency resources, are being punctured or taken away from theregular user(s) 502. As illustrated in FIG. 6, the range in thefrequency dimension of the puncturing may be the entirety of the usedfrequency channels or sub-bands allocated for downlink data, or inanother example, the frequency range of the puncturing may be a portionof the frequency channels or sub-bands allocated for downlink data. Inanother example, the control information 508 may include informationidentifying a user for which its previously allocated time-frequencyresource is being punctured. In still another example, the controlinformation 508 may include information identifying which TTI or TTIs inwhich a resource modification is occurring. For example, the controlinformation 508 need not necessarily occur within the same short TTI asthe resource modification indicated in the control information 508. Instill another example, the control information 508 may includeinformation about an adjustment to a rate matching algorithm that may beutilized on any remaining regular user data that may be affected by itsinterruption by the LoLat user data 504.

That is, in the illustrated example, as described above, this controlinformation 508 is transmitted during the same TTI as the informationdirected to the LoLat user 504. However, this is not the only examplewithin the scope of the present disclosure. In other examples, thecontrol information 508 may be carried during any suitable short TTI,before or even after the modified resource. That is, in some aspects ofthe disclosure, the regular users 502 may perform real-time processingof the information 508 in the thin control channel 506. However, inother aspects of the disclosure, the regular users 502 may not performreal-time processing of the information 508, since the regular users 502may generally have a more relaxed timeline, where they can tolerate morelatency and slower turnaround. To this end, the receiving subordinateentity 204 may include a data buffer in its memory 405, configured tobuffer downlink data and thin control information for any givenduration. As one illustrative example, the subordinate entity may bufferthe data received for a suitable buffer time. Here, at the end of thebuffer time, the receiving entity may process the received and buffereddownlink data and thin control information. At this time, theinformation in the thin control channel, such as the control information508, may be processed and applied to the buffered downlink data. Here,if the control information 508 indicates that any particulartime-frequency resource has been punctured or otherwise modified, theprocessing subordinate entity 204 may suitably forgo processing packetsat that resource or otherwise suitably process the packets as indicatedin the control information 508. For example, the regular user 502 mayzero out the log-likelihood-ratio (LLR) for the punctured time-frequencyresource elements. When the assignments are post-processed, the regularuser 502 can determine, in accordance with the information on the thincontrol channel 506, to wipe out the symbols it has buffered during theTTI corresponding to the punctured resources.

In a further aspect, the control information 508 may include informationfor the LoLat user 504 about its grant. In various examples, this may bethe same information as used to inform the regular users 502 about theirresource modification, or this may be separate information tailored forthe LoLat user 504. The control information 508 may further includeinformation identifying the LoLat user 504 for whom the LoLat downlinkdata is directed, information to assist the LoLat user 504 in receivingthe included downlink data (e.g., identification of the particulartime-frequency resource allocated, modulation and coding scheme, etc.),or any other suitable information directed to the LoLat user 504.

For the LoLat users 504, the short TTI may be used, as illustrated bythe relatively shorter width, in the time dimension, of thetime-frequency resources occupied by these LoLat users 504. That is,some users, or some types of communication may benefit from, or evenrequire, lower latency than might be available from the usage of thelong (non-LoLat) TTI. Accordingly, by utilizing a short TTI, lowerlatency may be achieved. The duration of information symbols carriedwithin either of the long or short TTIs may also take any suitableduration, with one example being a 10 μs duration for each symbol. In anexample wherein orthogonal frequency division multiplexing is adopted,an additional 1 μs cyclic prefix may be added to the symbol duration.

In various aspects of the disclosure, the information on the thincontrol channel 506 may include other information beyond the controlinformation 508 for re-allocating time-frequency resources, as describedabove. For example, the thin control channel 506 may in some examplescarry grant information indicating what time-frequency resources aregranted to the regular user(s) 502. Of course, another channel orchannels may be utilized for the grant of long TTI downlink resources.That is, in some examples, a separate grant channel (not illustrated)may be utilized to assign resources to the regular users 502.

By utilizing this scheme, the regular users 502 may generally utilizethe long TTI, and may further utilize a suitable processing timeline.The processing timeline may be somewhat on the longer side, as extremelyfast turnaround might not be needed for the regular users 502. On theother hand, LoLat users 504 may generally utilize the short TTI, and mayfurther utilize a fast-turnaround processing timeline.

FIG. 7 is a call flow diagram illustrating an exemplary resourceassignment and re-assignment procedure as it might occur in accordancewith one example for multiplexing downlink data with different latencytargets. In this illustration, time moves forward in the downwarddirection, and communication signals between the illustrated entitiesare denoted with arrows between the lines below the respective entities.As illustrated, a scheduling entity 202 is in communication with aplurality of subordinate entities 204, including a regular user 502 anda LoLat user 504.

FIG. 7 is described below in conjunction with a flow chart illustratedin FIG. 8. That is, FIG. 8 is a flow chart illustrating an exemplaryprocess 800 for resource assignment and re-assignment in accordance withsome aspects of the present disclosure. The process 800 is describedfrom the point-of-view of a scheduling entity 202, and may accordingly,as described in conjunction with FIG. 7, be operational at thescheduling entity described above in conjunction with FIGS. 2 and/or 3.In other examples within the scope of the present disclosure, theprocess 800 may be operational by a general purpose processor, aprocessing system 314 as described above and illustrated in FIG. 3, orany suitable means for carrying out the described functions.

At block 802, the scheduling entity 202 may transmit a first assignmentor grant 702 of time-frequency resources to at least one subordinateentity. Any suitable downlink control channel may be utilized at block802 for the first resource assignment 702, such as a downlink assignmentchannel. For example, the first assignment or grant 702 may occur at thestart of the long TTI, or in other examples, the first assignment orgrant might span the whole long TTI. In the case that the firstassignment or grant 702 spans the whole long TTI, then any modificationto the resource assignment or grant may be processed at the end of thelong TTI. Here, the first resource assignment 702 may be configured toindicate which time-frequency resource or resources are assigned to thesubordinate entity for regular receiving downlink data transmissions,that is, transmissions utilizing the long TTI. In accordance with thefirst resource assignment 702, at block 804, the scheduling entity 202may transmit regular downlink data 704 to the at least one subordinateentity (e.g., the subordinate entities 502 and 504) utilizing the longTTI. Here, with reference to FIG. 6, this regular downlink data 704 maycorrespond to the transmissions to regular users 502. As illustrated inFIG. 7 with the dashed-line arrow, regular downlink data may optionallybe transmitted to the second subordinate entity 504, depending on thecontents of the first resource assignment 702 and whether the secondsubordinate entity 504 is configured to receive downlink datatransmissions utilizing the long TTI.

The blocks 802 and 804 may repeat, or be iterated a plurality of timesin various examples, as regular downlink data 704 may continue to betransmitted to the subordinate entities consuming the regular downlinkdata 704. For example, at block 806, the scheduling entity 202 maydetermine that there is no LoLat data to transmit to any schedulingentity or entities. However, at any given time, it may arise that thescheduling entity 202 may wish to transmit LoLat data to the LoLat user504. For example, at block 806, the scheduling entity 202 may determinethat there is LoLat data to transmit to one or more scheduling entities.Accordingly, at block 808, the scheduling entity 202 may perform a setof actions, the set denoted in FIG. 7 with the dashed-line box 706,during the duration of a short TTI that interrupts or overlaps the longTTI corresponding to the first resource assignment. In some examples,these actions in the box 706 may be performed simultaneously. However,as described above, any or all of the actions in the box 706 may inother examples be offset in time, wherein post-processing of the dataand control channels can enable the processing of the LoLat data andscheduling assignments by all of the subordinate entities in thenetwork.

That is, at block 808, the scheduling entity 202 may transmit ascheduling grant modification 508 (see FIGS. 6-7) on a downlink thincontrol channel 506, as described above. The scheduling grantmodification 508 may include information informing the regular users502, and in some examples, also the LoLat user(s) 504 of themodification of the grant of time-frequency resources, so that therespective subordinate entities may properly decode the downlink data.Furthermore, the scheduling entity 202 may transmit a second assignmentor grant of time-frequency resources 708 (see FIG. 7) to the LoLat user502. The particular channel to utilize for the second resourceassignment 708 is not illustrated in FIG. 6, but any suitable downlinkcontrol channel may be utilized for the second resource assignment 708.Still further, the scheduling entity 202 may transmit the LoLat downlinkdata 710 to the LoLat user 504 utilizing one or more short TTIs.

Once again, in some aspects of the disclosure, the transmission of thescheduling grant modification 508, the transmission of the secondresource assignment or LoLat grant 708, and the transmission of theLoLat downlink data 710 may each occur simultaneously, that is, withinthe same short TTI, as illustrated in FIG. 6. Of course, as describedabove, in other aspects of the disclosure, these transmissions need notnecessarily occur during the same short TTI. That is, the receivingsubordinate entities 204 may include a data buffer within their memory405, into which the contents of the scheduling grant modification 508,the second resource assignment 708, and the LoLat downlink data 710 maybe stored for post-processing (e.g., at the end of the ongoing long TTI,or at any suitable time).

At block 810, the scheduling entity may resume transmission of thedownlink data utilizing the long TTI. Here, in some examples, theresumption of long-TTI downlink data transmission may take place uponcompletion of the transmission of the LoLat user data. However, it isnot necessarily the case that all of the long-TTI downlink data ceasedduring transmission of the LoLat user data. For example, referring toFIG. 6, in at least some of the short TTIs utilized for the transmissionof the LoLat user data, long-TTI downlink data may simultaneously betransmitted on different time-frequency resources. That is, in someaspects of the disclosure, only a portion of subcarriers, channels, orbandwidth may be utilized for LoLat data, while other portions ofsubcarriers, channels, or bandwidth may be utilized to continuetransmitting long-TTI downlink data.

By utilizing the above scheme, the thin control channel 506 can enable ascheduling entity to multiplex at least two different data types orcategories, having different TTIs, for downlink transmission to a set ofsubordinate entities.

UL/UL Multiplexing

FIG. 9 is a schematic illustration of an example of a synchronousmultiple access channel structure including a thin control channel as itmay be implemented according to further aspects of the presentdisclosure. In this illustration, the channel structure may beapplicable to an uplink data transmission, i.e., a transmission from asubordinate entity to a scheduling entity. Of course, this channelstructure is not limited to such a scheme, but rather may be generalizedto be applicable to any link where the receiving device is schedulingthe traffic.

As in the downlink example described above, here, uplink time-frequencychannel resources for various users of the air interface occupy givenareas within the channel, as identified in the different blocks. Forexample, some of the time-frequency resources may be utilized by“regular” users 902, which have less stringent latency requirements fortheir communication. In the illustration, as one example, six regularusers 902 labeled User A, B, C, D, E, and F are each scheduledtime-frequency resources as indicated by their respectfully labeledblocks. Of course, in various examples any number of users may bescheduled the use of resources. Further, while in the illustration allof the time-frequency resources are shown being assigned to regularusers, in various examples some or even all of the time-frequencyresources may be unassigned, or assigned for another purpose other thanfor regular user data.

In the context of the present disclosure, a regular user 902 may be asubordinate entity 204 that receives a resource assignment from ascheduling entity 202, where the resource assignment indicates for thesubordinate entity 204 to utilize a long TTI. Such regular users 902 maybe more tolerant to latency in their communication, and may in someexamples be more optimized for capacity. Accordingly, these users mayutilize such longer TTIs for packets that can tolerate more latency thanother users or other types of communication that might require LoLatcommunication. A long TTI may broadly be any TTI that is longer than ashort TTI, described in further detail below. In some examples, a longTTI may be a TTI that has a duration of a plurality of data symbols, ortime slots. Some non-limiting examples of a long TTI may have a durationof 100 μs, 240 μs, or 1 ms. Of course, any suitable duration for a longTTI may be utilized within the scope of the disclosure.

Furthermore, as illustrated in FIG. 9, in addition to the uplink datatraffic channels used by the regular users 902, a “thin” feedbackchannel 907 in the uplink direction may be utilized as illustrated.Here, the thin feedback channel 907 may be the same as the thin feedbackchannel 214 described above and illustrated in FIG. 2. Within thepresent disclosure, the thin feedback channel may lie in one or morefrequency sub-band(s) outside of (e.g., above) the frequency sub-bandsutilized by the uplink traffic transmissions, such as the allocatedtime-frequency resources described above for regular users A-F 902. Thewidth of the thin feedback channel 907 in the frequency direction may bereduced or minimized so as to reduce or minimize the amount of overheadutilized by the thin feedback channel 907.

Still further, as illustrated in FIG. 9, in addition to the uplinktraffic and feedback channels, a thin control channel 906 may beutilized in the downlink direction as illustrated. Here, the thincontrol channel 906 may be the same as one or both of the thin controlchannels 208/212 described above and illustrated in FIG. 2. Within thepresent disclosure, the thin control channel may lie in one or morefrequency sub-band(s) outside of the frequency sub-bands utilized by theuplink traffic and feedback transmissions, such as the allocatedtime-frequency resources described above for regular users A-F 902 andthe thin feedback channel 907. For example, in a frequency divisionduplex (FDD) system, the thin control channel 906 on the downlink may bein a different band than the uplink traffic and feedback channels, on inthe same band but on a different frequency channel. The width of thethin control channel 906 in the frequency direction may be reduced orminimized so as to reduce or minimize the amount of overhead utilized bythe control channel 906. In a further aspect, all active users (e.g.,subordinate entities 204 including but not necessarily limited to theregular users 902) in communication with the scheduling entity 202 thatbroadcasts the thin control channel 906 may monitor (and, in someexamples, buffer) the thin control channel 906 shown herein.

As illustrated in FIG. 9, each time slot, symbol, or unit of the thincontrol channel 906 may correspond to the duration of a short TTI. Thatis, in some examples, the short TTI may correspond to the time durationof a single symbol. Some non-limiting examples of a short TTI may have aduration of 10 μs, 20 μs, 100 μs, or any other suitable duration that isshorter than the long TTI. In some examples, the long TTI may representan integer multiple of short TTIs. In some examples, a common symbolduration may be utilized within both the long TTI and the short TTI, orin other examples, different symbol durations may be utilized within thelong TTI and the short TTI.

Referring now to FIG. 10, an example is illustrated to show an exemplaryscheme for multiple access transmissions (e.g., uplink transmissions) bysubordinate entities, enabling multiplexing of the uplink transmissionsfrom one or more subordinate entities utilizing a long TTI and uplinktransmissions from one or more subordinate entities utilizing a shortTTI. That is, a plurality of regular users 902 may be transmittinguplink communications utilizing an existing assignment of time-frequencyresources. Here, any suitable control channel (not necessarily the thincontrol channel 906) in the downlink direction may be utilized to grantresources to the various entities in the network, such that thosesubordinate entities 204 may transmit long-TTI uplink data according totheir respective assignments.

Here, it may be the case that a subordinate entity in the network wishesto transmit LoLat data. Here, in order to maintain orthogonality among aplurality of subordinate entities, a central, scheduling entity may beutilized to schedule both the LoLat and long-TTI uplink transmissions byeach of the subordinate entities, and they may generally not randomlytransmit uplink data without receiving assigned time-frequency resourcesfor such transmissions. Accordingly, when a particular subordinateentity 204 determines that it has traffic (e.g., high priority traffic)that it wishes to be transmitted with a lower latency, then thesubordinate entity may transmit a LoLat scheduling request 909 on thethin feedback channel 907. The LoLat scheduling request 909 isillustrated as occupying a single short TTI, although this is notnecessarily always the case, and various LoLat scheduling requests mightoccupy any suitable number of short TTIs or symbol lengths. The contentsof the LoLat scheduling request 909 may include information about theLoLat data that the transmitting entity wishes to transmit, such as, forexample, length, data type, priority, a buffer status report (BSR), alatency bound, reliability information, or any other suitableinformation relating to the LoLat data. In some examples, the LoLatscheduling request 909 may consist of a single bit, while in otherexamples, the LoLat scheduling request 909 may include a plurality ofbits.

In response to the LoLat scheduling request 909, the receiving end ofthe LoLat scheduling request 909 (e.g., the scheduling entity 202) mayaccordingly determine to grant a scheduling adjustment. In this way, thescheduling entity 202 may make resources available for the requestingLoLat user 904 to make its LoLat uplink data transmission. Thus, thescheduling entity 202 may transmit, on the thin control channel 906, anuplink grant modification 908. This uplink grant modification 908 maynotify the regular users 902 that their grant is being modified, andthat the previously allocated long TTI time-frequency resources will bepunctured, and that the resources will not be used by the regular users902. Here, puncturing the resources of the regular user 902 may in someexamples mean that the regular user 902 ceases transmitting during thetime associated with the re-assigned short TTI. In other examples, whereone or more means of channel multiplexing may be used (including but notlimited to frequency division multiplexing and code divisionmultiplexing), puncturing the resources of the regular user 902 may meanthat the regular user 902 ceases using punctured resources but maycontinue transmitting uplink data utilizing another frequency or anotherscrambling code, other than the resource previously granted to the LoLatuser 904, in order to maintain orthogonality. As described above, thethin control channel 906 may be a point-to-multipoint broadcast channelmonitored by all subordinate entities 204 in communication with thescheduling entity 202. In this way, any user or users having theirformerly granted time-frequency resources punctured by the uplink grantmodification 908 can be informed or instructed not to transmit theiruplink transmission utilizing the particular time-frequency resource nowallocated to a LoLat user 904.

Here, when the regular user data is punctured, it may be the case thatsome of the regular data is simply lost. In this example, forward errorcorrection coding may be utilized to recover the user data in view ofthe lost symbols due to the puncturing. In another example, thesubordinate entity transmitting the regular user data may implement ratematching to account for the puncturing of the regular user data. Thatis, the subordinate entity may modify a portion of the regular datautilizing a rate matching algorithm to account for the lost resources.Those of ordinary skill in the art will understand a rate matchingprocedure, so the implementation details thereof are not providedherein. However, in essence, a rate matching algorithm configures anencoding algorithm for the data (e.g., the regular user data) to fitinto allocated physical resources. Thus, when the puncturing describedabove removes a portion of these resources, a rate matching algorithmmay actively adjust the encoding (e.g., by adjusting a coding rate) toaccount for the reduced amount of resources.

In another aspect of the disclosure, rather than puncturing thetime-frequency resources for the regular user data, the data from theregular user 902 and the data for the LoLat user 904 may overlap. Thatis, both uplink transmissions may occupy the same time-frequencyresources. Here, the receiving entity may be configured to account forthe interference that may occur, or in other examples, such interferencemay result in what may be considered acceptable data losses. In afurther example, modification of the regular user data transmission 902may be made to account for the overlapped transmissions, e.g., byadjusting the rate matching algorithm as described above.

In a further aspect, the uplink grant modification 908 may not onlyinclude grant modification information directed to the regular users902, but in some examples may further include grant information directedto the requesting LoLat user 904 indicating that the punctured orotherwise indicated time-frequency resources have been allocated to theLoLat user 904. In another example within the scope of the presentdisclosure, the grant information directed to the requesting LoLat user904 may be carried on an uplink grant channel (not illustrated)separated from, or different from the grant modification informationdirected to the regular users 902. That is, the thin control channel 906may in some examples exclude grant information for the LoLat user 904,this information being transmitted on any suitable downlink channelreadable by the requesting LoLat user 904. In any case, grantinformation directed to the requesting LoLat user 904 may includeinformation identifying the LoLat user 904, identifying one or moretime-frequency resources to use for the uplink LoLat data transmission,modulation and coding schemes, power control information, timing advanceinformation, or any other suitable information relating to the grantedresource for the requesting LoLat user 904.

In the illustration of FIG. 10, the LoLat user 904 transmits the LoLatscheduling request 909, but all subordinate entities, including theregular users 902, receive the uplink grant modification 908. Here, in afurther aspect of the disclosure, the regular users 902 may beconfigured such that they are capable of decoding the uplink grantmodification 908 relatively quickly, so that they can promptly ceasetransmitting (e.g., puncture their transmissions) during there-allocated short TTI(s). In this way, the time-frequency resources mayquickly be made available for the LoLat user 904 to transmit its LoLatsymbols.

It may be observed that, compared to the downlink scheme described aboveand illustrated in FIG. 6, the uplink scheme described here andillustrated in FIG. 10 has a relatively higher latency. This latency maybe due to a propagation delay for the uplink transmission of the LoLatscheduling request 909 to be received at the scheduling entity 202, aprocessing delay at the scheduling entity 202, a second propagationdelay for the downlink transmission of the uplink grant modification 908to be received at the subordinate entity 204, and a further delay untilthe allocated resources are available for the LoLat transmission.

FIG. 11 is a call flow diagram illustrating an exemplary resourceassignment and re-assignment procedure as it might occur in accordancewith one example for multiplexing uplink data with different latencytargets. In this illustration, time moves forward in the downwarddirection, and communication signals between the illustrated entitiesare denoted with arrows between the lines below the respective entities.As illustrated, a scheduling entity 202 is in communication with aplurality of subordinate entities 204, including a regular user 902 anda LoLat user 904.

FIG. 11 is described below in conjunction with a flow chart illustratedin FIG. 12. That is, FIG. 12 is a flow chart illustrating an exemplaryprocess 1200 for resource assignment and re-assignment in accordancewith some aspects of the present disclosure. The process 1200 isdescribed from the point-of-view of a scheduling entity 202, and mayaccordingly, as described in conjunction with FIG. 11, be operational atthe scheduling entity described above in conjunction with FIGS. 2 and/or3. In other examples within the scope of the present disclosure, theprocess 1200 may be operational by a general purpose processor, aprocessing system 314 as described above and illustrated in FIG. 3, orany suitable means for carrying out the described functions.

At block 1202, the scheduling entity 202 may transmit a first assignmentor grant 702 of time-frequency resources to at least one subordinateentity. Any suitable downlink control channel may be utilized at block1202 for the first resource assignment 1102. Here, the first resourceassignment 1102 may be configured to indicate which time-frequencyresource or resources are assigned to the subordinate entity for regularuplink data transmissions, that is, transmissions utilizing the longTTI. In accordance with the first resource assignment 1102, at block1204, the scheduling entity 202 may receive regular uplink data 1104from the at least one subordinate entity (e.g., the subordinate entities1102 and 1104) utilizing the long TTI. Here, with reference to FIG. 10,this regular uplink data 1104 may correspond to the transmissions fromthe regular users 902. As illustrated in FIG. 11 with the dashed-linearrow, regular uplink data may optionally be transmitted from thesubordinate entity 1104, depending on the contents of the first resourceassignment 1102 and whether the second subordinate entity 1104 isconfigured to transmit uplink data transmissions utilizing the long TTI.

The blocks 1202 and 1204 may repeat, or be iterated a plurality of timesin various examples, as regular uplink data 1104 may continue to betransmitted from the subordinate entities. However, at any given time,it may arise that the subordinate entity 1104 (i.e., the LoLat user 904)may wish to transmit LoLat data to the scheduling entity 202.Accordingly, at block 1206, the scheduling entity 202 may receive aLoLat scheduling request 909 on the thin feedback channel 907 from theLoLat user 904 (i.e., the second subordinate entity 1104). The LoLatscheduling request 909 may include information identifying therequesting subordinate entity 1104, and including any pertinentinformation relating to the LoLat data desired to be transmitted.

At block 1208, the scheduling entity 202 may transmit an uplinkscheduling grant modification 908 on the thin control channel 906. Here,the uplink scheduling grant modification 908 may instruct the regularusers 902, such as the first subordinate entity 1102, having grantedresources for long-TTI uplink transmissions, to puncture their uplinktransmissions during at least one designated short TTI. Further, atblock 1210, the scheduling entity 202 may transmit a second resourceassignment or grant 1106 of time-frequency resources to the requestingsubordinate entity 1104 (i.e., the LoLat user 904). Here, the secondresource assignment 1106 may include information identifying therequesting subordinate entity 1104, and information identifying thetime-frequency resources granted for the LoLat uplink transmission. Insome examples, the transmission of the uplink scheduling grantmodification 908 at block 1208, and the transmission of the secondresource assignment 1106 at block 1210, may occur simultaneously. Thatis, these transmissions may be multiplexed, for example, utilizingdifferent time-frequency resources. In other examples, thesetransmissions may be at different times, according to the details of aparticular implementation.

Block 1212 represents operations at subordinate entities, such as theregular users 902 and LoLat user(s) 904. That is, in response to theuplink grant modification 908, the regular users 902 (i.e., the firstsubordinate entity 1102) may puncture their previously scheduled uplinkdata transmissions that utilize the long TTI. Further, in response tothe second resource assignment 1106, the LoLat user(s) 904 (i.e., thesecond subordinate entity 1104) may transmit the LoLat uplink data 1108utilizing the assigned time-frequency resources.

At block 1214, the scheduling entity 202 may receive the LoLat uplinkdata 1108 transmitted from the requesting subordinate entity 1104utilizing the short TTI.

Block 1216 represents further operations at subordinate entities, suchas the regular users 902 and, in some examples, LoLat user(s) 904. Thatis, the regular subordinate entities may resume their regular uplinkdata transmissions when transmission of the LoLat uplink data has beencompleted. Accordingly, at block 1218, the scheduling entity 202 mayresume receiving regular uplink data from one or more subordinateentities utilizing the long TTI.

By utilizing the above scheme, the thin control channel 906 can enable ascheduling entity to multiplex at least two different data types orcategories, having different TTIs, for uplink transmissions from a setof subordinate entities.

Interference Management

In a further aspect of the disclosure, by virtue of the thin controlchannel described herein above, not only may channels and users havingdifferent waveforms, latencies, and TTIs be multiplexed together.Further, effective interference management and link adaptation may beenabled. For example, while operating in a wireless communicationnetwork, the amount of interference that a mobile communication devicemay be subject to, may vary over time. Particularly in unlicensed orless coordinated deployments, such wireless communication devices mayundergo excessive interference. In accordance with an aspect of thepresent disclosure, if a wireless communication device, such as thescheduling entity 202 and/or the subordinate entity 204 experiencesexcessive and/or time-varying interference, the receiving wirelesscommunication device may transmit feedback to the transmitting device toindicate that an interference condition exists. This feedbackinformation relating to interference may be transmitted on a suitablethin control channel, a thin feedback channel, or other suitable thintransmission channel as described in the present disclosure.

The feedback information transmitted by the receiving device that isexperiencing the interference (e.g., the scheduling entity 202 and/orthe subordinate entity 204) may include various suitable information,including but not limited to information about the interferer and/orinterfering signal, time (persistency) of the interferer, frequency,power, spatial information, etc. The information transmitted by thereceiving device can also include a channel quality indicator (CQI),which may indicate how poor the channel is in the presence of theinterferer. Still further, the information transmitted may include apacket duration in each symbol, with a count-down field in each symbol.

Some existing CQI implementations, such as those in LTE or earliercommunication standards, may be relatively computationally intensive.Thus, for 5G CQI feedback, in some aspects of the present disclosure,the amount of complexity of CQI computation may be desired to be reducedor simplified. To this end, the receiving device subject to interferenceand generating a CQI on a thin control channel or feedback channeltransmission may not necessarily check all possible beamformingdirections. That is, in some aspects of the present disclosure, the CQIreporting device may report what rank is feasible for transmissions, andunder those hypotheses, what capacity the device sees, which may bereported to the receiving entity what modulation and coding scheme (MCS)the reporting entity can support. The CQI might in some examples be assimple as an indication that interference jumped by a determined amount,say 10 dB.

Referring again to FIG. 5, in the context of downlink transmissions, inthe case that a regular user 502 is experiencing interference, e.g.,from a jamming signal, the regular user 502 may transmit feedback on athin feedback channel to tell the transmitting device (e.g., thescheduling entity 202) that it is experiencing interference. Here, thefeedback may be configured to indicate to the scheduling entity 202 toabandon those packets due to a low likelihood of being properly decoded,or to request the scheduling entity 202 to alter its transmissionstrategy (e.g., the modulation, the coding scheme, the power, orotherwise). Thus, a thin control channel (and/or a thin feedbackchannel) can provide a fast feedback mechanism that can enable thetransmitting device to perform more dynamic link adaptation.

In the case that a jamming signal is very short in duration, there maybe little that a UE can accomplish in terms of dynamic adaptation ofdownlink transmissions utilizing the thin control channel. However, if ajammer is persistent, potentially wiping out one or more entire long TTIsubframes, then such fast feedback to the scheduling entity can be takeninto account by the scheduling entity for future transmissions. Forexample, just because one UE is subject to interference from a jammingsignal, another UE may not. In this case, the scheduling entity maycease transmitting to the affected UE and may instead transmit toanother user not suffering from the interference.

FIG. 13 is a flow chart illustrating an exemplary process 1300 forinterference mitigation in accordance with some aspects of thedisclosure. In some examples, the process 1300 may be implemented by ascheduling entity 202, as described above and illustrated in FIG. 3. Insome examples, the process 1300 may be implemented by the processingsystem 314 described above and illustrated in FIG. 3, or by any suitablemeans for carrying out the described functions.

At block 1302, the scheduling entity 202 may communicate with one ormore subordinate entities, such as the subordinate entity 204 describedabove and illustrated in FIG. 4, utilizing a long TTI for uplink and/ordownlink communication. At block 1304, the scheduling entity 202 mayreceive information on a thin control channel transmitted from asubordinate entity 204. For example, the information received on thethin control channel may include one or more of a channel qualityindicator (CQI), an interference metric (e.g., a parameter related to ordirectly indicating an amount of interference), or some other parameteror metric relating to interference experienced at the subordinateentity.

At block 1306, the scheduling entity 202 may accordingly suspend itscommunication with the subordinate entity 204. Here, in the case ofdownlink transmissions, the scheduling entity 202 may suspend itstransmissions to the subordinate entity 204. In the case of uplinktransmissions, a further handshake may take place, e.g., wherein thescheduling entity 202 instructs the subordinate entity 204 to suspendits uplink transmissions. In this way, a high error probability that maybe associated with the interference condition being experienced by thesubordinate entity can be avoided, and therefore, wasted resources canbe reduced or avoided. In a further example, in addition to suspendingthe communication with the subordinate entity, the scheduling entity 202may re-allocate resources formerly assigned to the respondingsubordinate entity 204, to one or more other subordinate entities. Thatis, the scheduling entity 202 may schedule communication with one ormore other subordinate entities during the suspension of thecommunication with the subordinate entity.

In another example, rather than suspending the communication with thesubordinate entity 204, the scheduling entity 202 may modify amodulation and coding scheme (MCS) of the ongoing communication with thesubordinate entity 204. For example, the scheduling entity 202 maytransmit control information to the subordinate entity 204 assigning thenew MCS for the subordinate entity to utilize, the new MCS configured toreduce or avoid the effects of the interference reported by thesubordinate entity 204.

As those skilled in the art will readily appreciate, various aspectsdescribed throughout this disclosure may be extended to any suitabletelecommunication systems, network architectures and communicationstandards. By way of example, various aspects may be applied to UMTSsystems such as W-CDMA, TD-SCDMA, and TD-CDMA. Various aspects may alsobe applied to systems employing Long Term Evolution (LTE) (in FDD, TDD,or both modes), LTE-Advanced (LTE-A) (in FDD, TDD, or both modes),CDMA2000, Evolution-Data Optimized (EV-DO), Ultra Mobile Broadband(UMB), IEEE 802.11 (Wi-Fi), IEEE 802.16 (WiMAX), IEEE 802.20,Ultra-Wideband (UWB), Bluetooth, and/or other suitable systems,including those described by yet-to-be defined wide area networkstandards. The actual telecommunication standard, network architecture,and/or communication standard employed will depend on the specificapplication and the overall design constraints imposed on the system.

Within the present disclosure, the word “exemplary” is used to mean“serving as an example, instance, or illustration.” Any implementationor aspect described herein as “exemplary” is not necessarily to beconstrued as preferred or advantageous over other aspects of thedisclosure. Likewise, the term “aspects” does not require that allaspects of the disclosure include the discussed feature, advantage ormode of operation. The term “coupled” is used herein to refer to thedirect or indirect coupling between two objects. For example, if objectA physically touches object B, and object B touches object C, thenobjects A and C may still be considered coupled to one another—even ifthey do not directly physically touch each other. For instance, a firstdie may be coupled to a second die in a package even though the firstdie is never directly physically in contact with the second die. Theterms “circuit” and “circuitry” are used broadly, and intended toinclude both hardware implementations of electrical devices andconductors that, when connected and configured, enable the performanceof the functions described in the present disclosure, without limitationas to the type of electronic circuits, as well as softwareimplementations of information and instructions that, when executed by aprocessor, enable the performance of the functions described in thepresent disclosure.

One or more of the components, steps, features and/or functionsillustrated in FIGS. 1-13 may be rearranged and/or combined into asingle component, step, feature or function or embodied in severalcomponents, steps, or functions. Additional elements, components, steps,and/or functions may also be added without departing from novel featuresdisclosed herein. The apparatus, devices, and/or components illustratedin FIGS. 1-13 may be configured to perform one or more of the methods,features, or steps described herein. The novel algorithms describedherein may also be efficiently implemented in software and/or embeddedin hardware.

It is to be understood that the specific order or hierarchy of steps inthe methods disclosed is an illustration of exemplary processes. Basedupon design preferences, it is understood that the specific order orhierarchy of steps in the methods may be rearranged. The accompanyingmethod claims present elements of the various steps in a sample order,and are not meant to be limited to the specific order or hierarchypresented unless specifically recited therein.

The previous description is provided to enable any person skilled in theart to practice the various aspects described herein. Variousmodifications to these aspects will be readily apparent to those skilledin the art, and the generic principles defined herein may be applied toother aspects. Thus, the claims are not intended to be limited to theaspects shown herein, but are to be accorded the full scope consistentwith the language of the claims, wherein reference to an element in thesingular is not intended to mean “one and only one” unless specificallyso stated, but rather “one or more.” Unless specifically statedotherwise, the term “some” refers to one or more. A phrase referring to“at least one of” a list of items refers to any combination of thoseitems, including single members. As an example, “at least one of: a, b,or c” is intended to cover: a; b; c; a and b; a and c; b and c; and a, band c. All structural and functional equivalents to the elements of thevarious aspects described throughout this disclosure that are known orlater come to be known to those of ordinary skill in the art areexpressly incorporated herein by reference and are intended to beencompassed by the claims. Moreover, nothing disclosed herein isintended to be dedicated to the public regardless of whether suchdisclosure is explicitly recited in the claims. No claim element is tobe construed under the provisions of 35 U.S.C. § 112(f), unless theelement is expressly recited using the phrase “means for” or, in thecase of a method claim, the element is recited using the phrase “stepfor.”

What is claimed is:
 1. A method of wireless communication, comprising:transmitting, within a first transmission time interval (TTI), a grantof time-frequency resources for first data within the first TTI;transmitting the first data on the downlink data channel during thefirst TTI; configuring control information to include a grantmodification configured to modify the grant of time-frequency resourcesfor the first data within the first TTI; and transmitting the controlinformation on a downlink control channel during a second TTI shorter induration than the first TTI and that overlaps a portion of the firstTTI.
 2. The method of claim 1, further comprising transmitting seconddata on the downlink data channel utilizing a TTI having the duration ofthe second TTI.
 3. The method of claim 2, wherein the transmittingcontrol information on the downlink control channel and the transmittingsecond data on the downlink data channel are performed at the same time.4. The method of claim 2, further comprising orthogonally multiplexingthe second data with the first data on the downlink data channel bypuncturing the first data with the second data in accordance with thecontrol information on the downlink control channel.
 5. The method ofclaim 4, further comprising modifying the first data to account for lostdownlink resources corresponding to the puncturing.
 6. The method ofclaim 2, further comprising non-orthogonally multiplexing the seconddata with the first data on the downlink data channel by simultaneouslytransmitting the first data and the second data.
 7. The method of claim1, wherein the downlink data channel is separated in frequency from thedownlink control channel.
 8. An apparatus configured for wirelesscommunication, comprising: at least one processor; a computer-readablemedium communicatively coupled to the at least one processor; and atransceiver communicatively coupled to the at least one processor,wherein the at least one processor is configured to: utilize thetransceiver to transmit, within a first transmission time interval(TTI), a grant of time-frequency resources for first data within thefirst TTI; utilize the transceiver to transmit the first data on thedownlink data channel during the first TTI; configure controlinformation to include a grant modification configured to modify thegrant of time-frequency resources for the first data within the firstTTI; and utilize the transceiver to transmit the control information ona downlink control channel during a second TTI shorter in duration thanthe first TTI and that overlaps a portion of the first TTI.
 9. Theapparatus of claim 8, wherein the at least one processor is furtherconfigured to utilize the transceiver to transmit second data on thedownlink data channel utilizing a TTI having the duration of the secondTTI.
 10. The apparatus of claim 9, wherein the at least one processor isfurther configured to utilize the transceiver to transmit controlinformation on the downlink control channel and to transmit second dataon the downlink data channel at the same time.
 11. The apparatus ofclaim 9, wherein the at least one processor is further configured toorthogonally multiplex the second data with the first data on thedownlink data channel by puncturing the first data with the second datain accordance with the control information on the downlink controlchannel.
 12. The apparatus of claim 11, wherein the at least oneprocessor is further configured to modify the first data to account forlost downlink resources corresponding to the puncturing.
 13. Theapparatus of claim 9, wherein the at least one processor is furtherconfigured to non-orthogonally multiplex the second data with the firstdata on the downlink data channel by utilizing the transceiver tosimultaneously transmit the first data and the second data.
 14. Theapparatus of claim 8, wherein the downlink data channel is separated infrequency from the downlink control channel.
 15. An apparatus configuredfor wireless communication, comprising: means for transmitting, within afirst transmission time interval (TTI), a grant of time-frequencyresources for first data within the first TTI; means for transmittingthe first data on the downlink data channel during the first TTI; meansfor configuring control information to include a grant modificationconfigured to modify the grant of time-frequency resources for the firstdata within the first TTI; and means for transmitting the controlinformation on a downlink control channel during a second TTI shorter induration than the first TTI and that overlaps a portion of the firstTTI.
 16. The apparatus of claim 15, further comprising means fortransmitting second data on the downlink data channel utilizing a TTIhaving the duration of the second TTI.
 17. The apparatus of claim 16,wherein the means for transmitting control information on the downlinkcontrol channel and the means for transmitting second data on thedownlink data channel are configured to transmit the control informationand the second data at the same time.
 18. The apparatus of claim 16,further comprising means for orthogonally multiplexing the second datawith the first data on the downlink data channel by puncturing the firstdata with the second data in accordance with the control information onthe downlink control channel.
 19. The apparatus of claim 18, furthercomprising means for modifying the first data to account for lostdownlink resources corresponding to the puncturing.
 20. The apparatus ofclaim 16, further comprising means for non-orthogonally multiplexing thesecond data with the first data on the downlink data channel bysimultaneously transmitting the first data and the second data.
 21. Theapparatus of claim 15, wherein the downlink data channel is separated infrequency from the downlink control channel.
 22. A non-transitorycomputer-readable medium comprising computer-executable code,comprising: instructions for causing a computer to transmit, within afirst transmission time interval (TTI), a grant of time-frequencyresources for first data within the first TTI; instructions for causinga computer to transmit the first data on the downlink data channelduring the first TTI; instructions for causing a computer to configurecontrol information to include a grant modification configured to modifythe grant of time-frequency resources for the first data within thefirst TTI; and instructions for causing a computer to transmit thecontrol information on a downlink control channel during a second TTIshorter in duration than the first TTI and that overlaps a portion ofthe first TTI.
 23. The non-transitory computer-readable medium of claim22, further comprising instructions for causing a computer to transmitsecond data on the downlink data channel utilizing a TTI having theduration of the second TTI.
 24. The non-transitory computer-readablemedium of claim 23, further comprising instructions for causing acomputer to transmit control information on the downlink control channeland to transmit second data on the downlink data channel at the sametime.
 25. The non-transitory computer-readable medium of claim 23,further comprising instructions for causing a computer to orthogonallymultiplex the second data with the first data on the downlink datachannel by puncturing the first data with the second data in accordancewith the control information on the downlink control channel.
 26. Thenon-transitory computer-readable medium of claim 25, further comprisinginstructions for causing a computer to modify the first data to accountfor lost downlink resources corresponding to the puncturing.
 27. Thenon-transitory computer-readable medium of claim 23, further comprisinginstructions for causing a computer to non-orthogonally multiplex thesecond data with the first data on the downlink data channel byutilizing the transceiver to simultaneously transmit the first data andthe second data.
 28. The non-transitory computer-readable medium ofclaim 22, wherein the downlink data channel is separated in frequencyfrom the downlink control channel.